Fast nearest neighbor search of entropy-constrained vector quantization
نویسندگان
چکیده
Entropy-constrained vector quantization (ECVQ) offers substantially improved image quality over vector quantization (VQ) at the cost of additional encoding complexity. We extend results in the literature for fast nearest neighbor search of VQ to ECVQ. We use a new, easily computed distance that successfully eliminates most codewords from consideration.
منابع مشابه
Entropy-constrained Vector Quantization
| Entropy-constrained vector quantization (ECVQ) 3] offers substantially improved image quality over vector quan-tization (VQ) at the cost of additional encoding complexity. We extend results in the literature for fast nearest neighbor search of VQ to ECVQ. We use a new, easily computed distance that successfully eliminates most codewords from consideration.
متن کاملFast Full-Search Equivalent Nearest-Neighbor Search Algorithm
A Fundamental activity in vector quantization involves searching a set of n kdimensional data to find the nearest one. We present a fast algorithm that is full-search equivalent, i.e. the match is as good as the one that could be found using exhaustive search. The proposed method utilizes law of cosines to calculate an estimate for distance, which is used to reduce the search area. Experiments ...
متن کاملA Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
A new fast nearest neighbor algorithm is described that uses principal component analysis to build an efficient search tree. At each node in the tree, the data set is partitioned along the direction of maximum variance. The search algorithm efficiently uses a depth-first search and a new elimination criterion. The new algorithm was compared to sixteen other fast nearest neighbor algorithms on t...
متن کاملConditional entropy-constrained vector quantization: high-rate theory and design algorithms
The performance of optimum vector quantizers subject to a conditional entropy constraint is studied in this paper. This new class of vector quantizers was originally suggested by Chou and Lookabaugh. A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of the well known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization o...
متن کاملFast nearest-neighbor search based on Voronoi projections and its application to vector quantization encoding
In this work, we consider two fast nearest-neighbor search methods based on the projections of Voronoi regions, namely, the boxsearch method and the cell-partition search method. We provide their comprehensive study in the context of vector quantization encoding. We show that the use of principal component transformation reduces the complexity of Voronoi-projection based search significantly fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 9 8 شماره
صفحات -
تاریخ انتشار 2000